منابع مشابه
Parallel Bucket Sorting Algorithm
Bucket sorting algorithm achieves O(n) running time complexity in average. It is very fast compared to any comparison-based sorting algorithms that usually have a lower bound of Ω(n log n). Given an unsorted array of n positive integers, bucket sorting algorithm works by distributing the elements into m ordered buckets each contains zero or more elements. Each bucket is then sorted using either...
متن کاملA General-Purpose Parallel Sorting Algorithm
A parallel sorting algorithm is presented for general purpose internal sorting on MIMD machines. The algorithm initially sorts the elements within each node using a serial sorting algorithm, then proceeds with a two-phase parallel merge. The algorithm is comparison-based and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm...
متن کاملA Fast, Storage-eecient Parallel Sorting Algorithm
A parallel sorting algorithm is presented for storage-eecient internal sorting on MIMD machines. The algorithm rst sorts the elements within each node using a serial sorting algorithm, then uses a two-phase parallel merge. The algorithm is comparison-based and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm on two general...
متن کاملParallel Algorithm for Sorting animal Pedigrees
In many analyses of animal genotype with the methods of quantitative genetics there is a need to account for relationships among individuals. Incorrectly calculated relationship coefficients may lead to biased estimates. The number of software packages exist which deal with that problem; however, in many of them it is assumed that pedigrees of the individuals are sorted chronologically, but in ...
متن کاملAn Optimal Parallel Algorithm for Sorting Multisets
We consider the problem of sorting n numbers that contain only k distinct values. We present a randomized arbitrary CRCW PRAM algorithm that runs in O(logn) time using n log k logn processors. The same algorithm runs in O ( logn log logn ) time with a total work of O(n(log k) ) for any fixed > 0. All the stated bounds hold with high probability.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2008
ISSN: 1549-3636
DOI: 10.3844/jcssp.2008.897.902